Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Fast geometric resistant video watermarking scheme for gateway copyright protection
LIU Hongbin DU Ling JI Hongli
Journal of Computer Applications    2013, 33 (12): 3531-3535.  
Abstract588)      PDF (799KB)(305)       Save
To solve the problem of gateway copyright protection, a new fast approach was put forward for embedding and extracting gateway watermark in digital video. In intra frame watermarking, the method elegantly detected and selected affine covariant regions in nearly linear complexity. Then, the overlapped affine covariant regions were eliminated based on minimal spanning tree. Last, watermark bits were embedded in Discrete Wavelet Transform (DWT) coefficients in linear time. In inter frame watermarking, the method effectively utilized the continuity inside video scenes to predict the affine covariant regions in no-boundary frames based on boundary frame. The attacking experimental results show that under geometric attacks and format conversion attacks, the accuracies of watermark detection are above 93% and 83% respectively. The simulation results show that in local network with 400 online hosts, the proposed method can block gateway watermark video transmission within 10 frames.
Reference | Related Articles | Metrics
Multiple samples alignment for GC-MS data in parallel on Sector/Sphere
YANG Huihua REN Hongjun LI Lingqiao DUAN Lixin GUO Tuo DU Lingling QI Xiaoquan
Journal of Computer Applications    2013, 33 (01): 215-218.   DOI: 10.3724/SP.J.1087.2013.00215
Abstract885)      PDF (616KB)(619)       Save
To deal with the problem that the process of Gas Chromatography-Mass Spectrography (GC-MS) data is complex and time consuming which delays the whole experimental progress, taking the alignment of multiple samples as an example, a parallel framework for processing GC-MS data on Sector/Sphere was proposed, and an algorithm of aligning multiple samples in parallel was implemented. First, the similarity matrix of all the samples was computed, then the sample set was divided into small sample sets according to hierarchical clustering and samples in each set were aligned respectively, finally the results of each set were merged according to the average sample of the set. The experimental results show that the error rate of the parallel alignment algorithm is 2.9% and the speedup ratio reaches 3.29 using the cluster with 4 PC, which can speed up the process at a high accuracy, and handle the problem that the processing time is too long.
Reference | Related Articles | Metrics